Computationally Efficient Two Stage Sequential Framework for Stereo Matching
نویسنده
چکیده
Almost all the existing stereo algorithms fall under a common assumption that corresponding color or intensity values will be similar like one another. On the other hand, it is also not that true in practice where the image color or intensity values are regularly affected by different radiometric factors like illumination direction, change in image device, illuminant color and so on. For this issue, the information about the raw color of the images which is recorded by the camera should not depend on it totally, and also the common assumptions on color consistency doesn’t influence good (great) between the stereo images in real scenario. Therefore, most of the conventional stereo algorithms can be seriously degraded in terms of performance under radiometric variations. In this work, we intend to develop a new stereo matching algorithm which will be insensitive to change in radiometric conditions between stereo pairs i.e. left image as well as right image. Unlike the other stereo algorithms, we propose a computationally efficient two stage sequential framework for stereo matching which can handle the various radiometric variations between the stereo pairs.Experimental results proves that the proposed method outperforms extremely well compare to other state of the art stereo methods under change in various radiometric conditions for a given stereo pair and it is also found from the results that the execution time is less compare to existing methods.
منابع مشابه
Efficient Line Matching by Image Sequential Analysis for Urban Area Modelling
3D city modelling from airborne imagery includes mainly two parts: (1) image processing procedures and (2) 3D modelling for manmade objects such as buildings, roads and other objects. Line extraction and stereo matching are usually utilized as an image processing procedures. However, there are some issues for automatic man-made object modelling. In particular, spatial data acquisition of buildi...
متن کاملA novel heterogeneous framework for stereo matching
Local stereo matching algorithms based on the adapting-weights strategy achieve accuracy similar to global approaches. One of the major problems of these local algorithms is that they are computationally expensive. However, algorithms with reduced computational complexity inspired by the adapting-weights strategy have been recently proposed. In particular, the Fast Bilateral Stereo (FBS) framew...
متن کاملA PC-based Real-Time Stereo Vision System
This paper describes a stereo vision system that enables real-time dense depth measurements on a personal computer. The system relies on a very efficient stereo matching engine that, unlike many other approaches which use two distinct matching phases in order to detect unreliable matches, uses a single matching phase. Our matching engine allows for rejecting most unreliable matches by exploitin...
متن کاملAutomatically Synthesising Virtual Viewpoints by Trinocular Image Interpolation — Detailed Report
image processing, image based rendering, computer graphics, stereo matching We present a computationally simple and fully automatic method for creating virtual views of a scene by interpolating between sets of images obtained from different viewpoints. The technique is intended to give an immersive experience and a sense of viewing a real environment. The method uses correspondence points ident...
متن کاملRevisiting Intrinsic Curves for Efficient Dense Stereo Matching
Dense stereo matching is one of the fundamental and active areas of photogrammetry. The increasing image resolution of digital cameras as well as the growing interest in unconventional imaging, e.g. unmanned aerial imagery, has exposed stereo image pairs to serious occlusion, noise and matching ambiguity. This has also resulted in an increase in the range of disparity values that should be cons...
متن کامل